DIJKSTRA ALGORITHM IN DETERMINING THE SHORTEST ROUTE FOR DELIVERY SERVICE BY J&T EXPRESS IN BANDUNG

The determination of the shortest route can be done using various methods, one which is Dijkstra algorithm. This algorithm often used in routing problems with minimum weight computer networks, communication networks and transportation networks. There are several applications Djikstra algorithm, namely solving problem path neutrosophy, mapping tourism potential, developing geographic information systems health sector. In this research, will applied to optimize mileage delivery goods packages. Data address, number customer packages carried by a courier trip obtained from drop point PT. J&T Express Sarijadi area Bandung City. Meanwhile, data about Google Maps application. All construct an initial model graph that connected weighted graph, where location or vertex road connecting two locations edge on graph. customers another. Then, run starting route, so visits all returns again point. resulting cycle closed at 1890 meters.